Introducing the Graph 500
نویسندگان
چکیده
In the words of Lord Kelvin, “if you cannot measure it, you cannot improve it”. One of the longlasting successes of the Top 500 list is sustained, community-wide floating point performance improvement. Emerging large-data problems, either resulting from measured real-world phenomena or as further processing of data generated by simulation, have radically different performance characteristics and architectural requirements. As the community contemplates scaling to large-scale HPC resources to solve these problems, we are challenged by the reality that supercomputers are typically optimized for the 3D simulation of physics, not large-scale, data-driven analysis. Consequently, the community contemplating this kind of analysis requires a new yard stick for evaluating future platforms. Since the invention of the von Neumann architecture, the physics simulation has largely driven the development and evolution of High Performance Computing. This allows scientists and engineers to test hypotheses, designs, and ask “what if” questions. Emerging informatics and analytics applications are different both in purpose and structure. While physics simulations typically are core-memory sized, floating point intensive, and well-structured, informatics applications tend to be out of core, integer oriented, and unstructured. (It could be argued that physics simulations are moving in this direction.) The graph abstraction is a powerful model in com-
منابع مشابه
A Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring
All the social networks can be modeled as a graph, where each roles as vertex and each relationroles as an edge. The graph can be show as G = [V;E], where V is the set of vertices and E is theset of edges. All social networks can be segmented to K groups, where there are members in eachgroup with same features. In each group each person knows other individuals and is in touch ...
متن کاملJust chromatic exellence in fuzzy graphs
A fuzzy graph is a symmetric binary fuzzy relation on a fuzzy subset. The concept of fuzzy sets and fuzzy relations was introduced by L.A.Zadeh in 1965cite{zl} and further studiedcite{ka}. It was Rosenfeldcite{ra} who considered fuzzy relations on fuzzy sets and developed the theory of fuzzy graphs in 1975. The concepts of fuzzy trees, blocks, bridges and cut nodes in fuzzy graph has been studi...
متن کاملLabeling Subgraph Embeddings and Cordiality of Graphs
Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, a vertex labeling $f : V(G)rightarrow mathbb{Z}_2$ induces an edge labeling $ f^{+} : E(G)rightarrow mathbb{Z}_2$ defined by $f^{+}(xy) = f(x) + f(y)$, for each edge $ xyin E(G)$. For each $i in mathbb{Z}_2$, let $ v_{f}(i)=|{u in V(G) : f(u) = i}|$ and $e_{f^+}(i)=|{xyin E(G) : f^{+}(xy) = i}|$. A vertex labeling $f$ of a graph $G...
متن کاملFinite-time Flocking of Multi-agent System with Input Saturation
In this paper a finite-time flocking of multi-agent system with input saturation is investigated. By introducing a new control protocol, it is show that speed and position of agents with double-integrator dynamics converge to the speed and position of leader in finite time. It is assumed that the graph between the agents is connected and that at least one agent is informed of the leader speed a...
متن کاملScale-Free Network in Stock Markets
We study the cross-correlations in stock price changes among the S&P 500 companies by introducing a weighted random graph, where all vertices (companies) are fully connected via weighted edges. The weight of each edge is distributed in the range of [−1, 1] and is given by the normalized covariance of the two modified returns connected, where the modified return means the return minus the mean o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010